2-Point site Voronoi diagrams
نویسندگان
چکیده
منابع مشابه
Realizing Farthest-Point Voronoi Diagrams
1 The farthest-point Voronoi diagram of a set of n sites 2 is a tree with n leaves. We investigate whether arbi3 trary trees can be realized as farthest-point Voronoi di4 agrams. Given an abstract ordered tree T with n leaves 5 and prescribed edge lengths, we produce a set of n sites 6 S in O(n) time such that the farthest-point Voronoi di7 agram of S represents T . We generalize this algorithm...
متن کاملTwo-Site Voronoi Diagrams under Geometric Distance Functions
We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, and analyze the structure and complexity of the nearestand furthest-neighbor Voronoi diagrams of a point set with respect to these distance functions.
متن کاملEnclosing Surfaces for Point Clusters Using 3D Discrete Voronoi Diagrams
Point clusters occur in both spatial and non-spatial data. In the former context they may represent segmented particle data, in the latter context they may represent clusters in scatterplots. In order to visualize such point clusters, enclosing surfaces lead to much better comprehension than pure point renderings. We propose a flexible system for the generation of enclosing surfaces for 3D poin...
متن کاملOn computing Voronoi diagrams for sorted point sets
We show that the Voronoi diagram of a nite sequence of points in the plane which gives sorted order of the points with respect to two perpendicular directions can be computed in linear time. In contrast, we observe that the problem of computing the Voronoi diagram of a nite sequence of points in the plane which gives the sorted order of the points with respect to a single direction requires (n ...
متن کاملLimits of Voronoi Diagrams
Dit proefschrift werd mede mogelijk gemaakt met financiële steun van de Nederlandse Organisatie voor Wetenschappelijk Onderzoek.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00320-1